Feature-Based Stereo Matching Using Graph Cuts

نویسندگان

  • Gorkem Saygili
  • Laurens van der Maaten
  • Emile A. Hendriks
چکیده

In this paper, we present a novel feature point based stereo matching algorithm with global energy minimization. The initial disparity map is estimated by considering matching SURF key points between two images inside each homogeneous colour region by an adaptive box matching approach. Next, we improve the initial disparity map with a RANSAC based plane fitting technique which relies on accuracy of the pixel disparities inside the homogeneous colour regions. Finally, the disparity map is further enhanced by incorporating energy constraints on smoothness between neighbouring regions using graph cuts. The methodology is tested on Middlebury test set and the results indicates that the proposed method is compatible with the current state-of-the-art stereo matching algorithms while decreasing the overall computational effort in matching process using already available feature points.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Adaptive Graph-Cuts Based Stereo Matching

Stereo vision is one of the central research problems in computer vision. The most difficult and important issue in this area is the stereo matching process. One technique that performs this process is the Graph-Cuts based algorithm and which provides accurate results [1]. Nevertheless, this approach is too slow to use due to the redundant computations that it invokes. In this work, an Adaptive...

متن کامل

Prediction Error Evaluation of Various Stereo Matching Algorithms on Long Stereo Sequences

Prediction errors are commonly used when analyzing the performance of a multi-camera stereo system using at least three cameras. This paper discusses this methodology for performance evaluation on long stereo sequences (in the context of vision-based driver assistance systems). Three cameras are calibrated in an ego-vehicle, and prediction error analysis is performed on recorded stereo sequence...

متن کامل

Performance Evaluation of Bit-plane Slicing based Stereo Matching Techniques

In this paper, we propose a hierarchical framework for stereo matching. Similar to the conventional image pyramids, a series of images with less and less information is constructed. The objective is to use bit-plane slicing technique to investigate the feasibility of correspondence matching with less bits of intensity information. In the experiments, stereo matching with various bit-rate image ...

متن کامل

Multispectral piecewise planar stereo using Manhattan-world assumption

This paper proposes a new framework for extracting dense disparity maps from a multispectral stereo rig. The system is constructedwith an infrared and a color camera. It is intended to explore novel multispectral stereo matching approaches that will allow further extraction of semantic information. The proposed framework consists of three stages. Firstly, an initial sparse disparitymap is gener...

متن کامل

Stereo Matching Using Iterated Graph Cuts and Mean Shift Filtering

In this paper, we propose a new stereo matching algorithm using an iterated graph cuts and mean shift filtering technique. Our algorithm consists of following two steps. In the first step, given an estimated sparse RDM (Reliable Disparity Map), we obtain an updated dense disparity map through a new constrained energy minimization framework that can cope with occlusion. The graph cuts technique ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011